Qualitative analysis of one-step iterative methods and consistent matrix splittings
نویسنده
چکیده
A qualitative analysis of one-step iterative methods is presented with special regard to the connection between concavity preservation and time-monotonicity. We also analyze the relation of one-step iterative methods to matrix splitting methods. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems
We study the numerical behavior of stationary one-step or two-step matrix splitting iteration methods for solving large sparse systems of linear equations. We show that inexact solutions of inner linear systems associated with the matrix splittings may considerably influence the accuracy of the approximate solutions computed in finite precision arithmetic. For a general stationary matrix splitt...
متن کاملComparison of Convergence of General Stationary Iterative Methods for Singular Matrices
New comparison theorems are presented comparing the asymptotic convergence factor of iterative methods for the solution of consistent (as well as inconsistent) singular systems of linear equations. The asymptotic convergence factor of the iteration matrix T is the quantity γ(T ) = max{|λ|, λ ∈ σ(T ), λ = 1}, where σ(T ) is the spectrum of T . In the new theorems, no restrictions are imposed on ...
متن کاملP-regular Splitting Iterative Methods for Non-hermitian Positive Definite Linear Systems
We study the convergence of P -regular splitting iterative methods for non-Hermitian positive definite linear systems. Our main result is that P -regular splittings of the form A = M−N , where N = N, are convergent. Natural examples of splittings satisfying the convergence conditions are constructed, and numerical experiments are performed to illustrate the convergence results obtained.
متن کاملEIGENVECTORS OF COVARIANCE MATRIX FOR OPTIMAL DESIGN OF STEEL FRAMES
In this paper, the discrete method of eigenvectors of covariance matrix has been used to weight minimization of steel frame structures. Eigenvectors of Covariance Matrix (ECM) algorithm is a robust and iterative method for solving optimization problems and is inspired by the CMA-ES method. Both of these methods use covariance matrix in the optimization process, but the covariance matrix calcula...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 55 شماره
صفحات -
تاریخ انتشار 2008